Regular languages with variables on graphs
نویسندگان
چکیده
منابع مشابه
Regular Languages in MAJ[>] with three variables
We consider first order logic over words and show FO + MOD[<] is contained in MAJ[<] with three variables. It is known that for the classes FO[<], FO + MOD[<], FO + GROUP[<] three variables suffice. In the case of MOD[<] even two variables are sufficient. As a consequence we know that if TC , NC then for every regular language describable in MAJ[<] three variables are sufficient.
متن کاملRegular Languages Definable by Majority Quantifiers with Two Variables
In this paper we consider the class of all regular languages definable by the extended majority quantifier and the order predicate but using only two variables. The main part of the paper is the presentation of a geometric method which is used to show that a given regular language cannot be defined by such formulas. Applying this method we can give a necessary condition in terms of an equation ...
متن کاملRepresenting Hyper-Graphs by Regular Languages
A new compact representation of innnite graphs is investigated. Regular languages are used to represent labelled hyper-graphs which can be also multi-graphs. Our approach is similar to that used by A. Ehrenfeucht et al. for nite graphs since we use a regular preex-free language as set of vertices, but it diiers from that in the representation of the edges. In fact, we use a regular language for...
متن کاملOn Message Sequence Graphs and Finitely Generated Regular MSC Languages
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication software. A standard method to describe multiple communication scenarios is to use message sequence graphs (MSGs). A message sequence graph allows the protocol designer to write a finite specification which combines MSCs...
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2012
ISSN: 0890-5401
DOI: 10.1016/j.ic.2011.10.010